NP-Completeness Results Concerning the Transformation of Logic Programs into Attribute Grammars
نویسنده
چکیده
Attribute grammars and logic programs are two well investigated formalisms, which were related in DM85] for the restricted class of simple logic programs. In this paper we deene the more restricted class of very simple logic programs and we prove that the problem of deciding, whether a given logic program is (very) simple, is NP{complete.
منابع مشابه
Can we transform logic programs into attribute grammars?
In this paper we study the relationship between Attribute Grammars and Logic Programs, concentrating on transforming logic programs into attribute grammars. This has potential applications in compilation techniques for logic programs. It does not seem possible to transform arbitrary Logic Programs into Attribute Grammars, basically because the same logic variables can sometimes be used as input...
متن کاملLogic Program Schemas, Semi-Uni cation and Constraints
The use of schemas is a classical way of synthesizing, transforming and analyzing logic programs. Operations on schemas are needed, in particular, the semi-uniication of schemas with programs. Since the schemas used in the paper are second-order objects, the related semi-uniication is the second-order semi-uniication, which is decidable but NP-complete. The non-determinism implied by the NP-com...
متن کاملHybrid Type-Logical Grammars, First-Order Linear Logic and the Descriptive Inadequacy of Lambda Grammars
Hybrid type-logical grammars (Kubota & Levine 2012, Kubota & Levine 2013c, Kubota & Levine 2013a) are a relatively new framework in computational linguistics, which combines insights from the Lambek calculus (Lambek 1958) and lambda grammars (Oehrle 1994, Muskens 2001, Muskens 2003)— lambda grammars are also called, depending on the authors, abstract categorial grammars (de Groote 2001) and lin...
متن کاملUsing Attribute Grammars to Derive Eecient Functional Programs
Two mappings from attribute grammars to lazy functional programs are deened. One of these mappings is an eecient implementation of attribute grammars. The other mapping yields ineecient programs. It is shown how some transformations of functional programs may be better understood by viewing the programs as ineecient implementations of attribute grammars.
متن کاملInversion of 2D Cellular Automata: Some Complexity Results
Durand, B. Inversion of 2D cellular automata: some complexity results, Theoretical Computer Science 134 (1994) 387401. In this paper, we prove the co-NP-completeness of the following decision problem: “Given a twodimensional cellular automaton & (even with Von Neumann neighborhood), is & injective when restricted to finite configurations not greater than its length?” In order to prove this resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Acta Cybern.
دوره 13 شماره
صفحات -
تاریخ انتشار 1998